Strongly regular graphs, partial geometries and partially balanced designs
نویسندگان
چکیده
منابع مشابه
Balanced colourings of strongly regular graphs
A colouring of a strongly regular graph is an allocation of colours (or treatments) to the vertices of the graph. Such a colouring is balanced if every pair of distinct colours occurs equally often on the ends of an edge. When the graph is the complete regular multipartite graph a balanced colouring is just a balanced incomplete-block design, or 2-design. Some constructions are given. For examp...
متن کاملMatrix techniques for strongly regular graphs and related geometries
(otherwise we divide the vector by an appropriate scalar), so w.l.o.g. we have uj = 1 for a certain j ∈ {1, . . . , v}. The absolute value |(A~u)j| of the j-th component of A~u is at most ∑ i∼j |ui|; since the absolute values of all components of ~u are less than or equal to 1, we have ∑ i∼j |ui| ≤ k. On the other hand |(A~u)j| must be equal to |ρuj| = |ρ|, from which we obtain |ρ| ≤ k. If ρ = ...
متن کاملRing geometries, two-weight codes, and strongly regular graphs
It is known that a linear two-weight code C over a finite field Fq corresponds both to a multiset in a projective space over Fq that meets every hyperplane in either a or b points for some integers a < b , and to a strongly regular graph whose vertices may be identified with the codewords of C . Here we extend this classical result to the case of a ring-linear code with exactly two nonzero homo...
متن کاملPartially Distance-regular Graphs and Partially Walk-regular Graphs∗
We study partially distance-regular graphs and partially walkregular graphs as generalizations of distance-regular graphs and walkregular graphs respectively. We conclude that the partially distanceregular graphs can be viewed as some extremal graphs of partially walk-regular graphs. In the special case that the graph is assumed to be regular with four distinct eigenvalues, a well known class o...
متن کاملE-optimal Semi-regular Graph Designs and Partially Efficiency Balanced Designs
Jacroux (1985) extended the definition of Regular graph designs of Mitchell and John (1976) to Semi-regular graph (SRG) designs, and studied the type 1 optimality of block designs. Here, the construction and optimality of some more SRG designs are discussed. Moreover, in this investigation, it is established that a class of two associate partially efficiency balanced design is, in fact SRG desi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1963
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1963.13.389